Page Access Sequencing in Join Processing with Limited Buffer Space
نویسندگان
چکیده
منابع مشابه
Efficient Join-Index-Based Spatial-Join Processing: A Clustering Approach
A join-index is a data structure used for processing join queries in databases. Join-indices use precomputation techniques to speed up online query processing and are useful for data sets which are updated infrequently. The I/O cost of join computation using a join-index with limited buffer space depends primarily on the page-access sequence used to fetch the pages of the base relations. Given ...
متن کاملEfficient Join-Index-Based Join Processing: A Clustering Approach
A Join Index is a data structure used for processing join queries in databases. Join indices use pre-computation techniques to speed up online query processing and are useful for data-sets which are updated infrequently. The cost of join computation using a join-index with limited buuer space depends primarily on the page-access sequence used to fetch the pages of the base relations. Given the ...
متن کاملOn Two-Echelon Multi-Server Queue with Balking and Limited Intermediate Buffer
In this paper we study two echelon multi-server tandom queueing systems where customers arrive according to a poisson process with two different rates. The service rates at both echelons are independent of each other. The service times of customers is assumed to be completed in two stages. The service times at each stage are exponentially distributed. At the first stage, the customers may balk ...
متن کاملOptimizing Join Index Based Spatial-Join Processing: A Graph Partitioning Approach
A Join Index is a data structure that optimizes the join query processing in spatial databases. Join indices use pre-computation techniques to speed up online query processing and are useful for applications which require low update rates. The cost of spatial join computation using a join-index with limited buuer space depends primarily on the page access sequence used to fetch the pages of the...
متن کاملA Review of Heuristics for Optimal Page Access Sequence with a Model for Spatial Queries
Spatial Database Systems are very large databases requiring storage in disk devices. The join process between two relations that is based on spatial nature of the attributes needs repeated and redundant disk accesses. This necessitates the implementation of join index which accelerates the join processing between two relations and it incurs high over head. This work studies the heuristics that ...
متن کامل